Asking and Answering Queries Semantically

نویسندگان

  • Paolo Bouquet
  • Gabriel M. Kuper
  • Stefano Zanobini
چکیده

In this paper we propose a new method, called SEMQUERY, for querying information sources whose data are organized according to different schemata. The method is based on the idea of semantic elicitation, namely a process which takes in input the structural part of a query (e.g. the XPath part of an XQuery) and returns an expression in a logical language which represent the meaning of the query in a form which ideally is independent from its original syntactic formulation. Since the same process of elicitation can be performed on any path of schemata used to organize data, the decision on whether there is any logical relation between a query and a path in the schema is made via logical reasoning.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Data Exchange: Algorithm for Computing Maybe Answers for Relational Algebra Queries

The concept of certain answers is usually used in the definition of the semantics of answering queries in data exchange. But as certain answers are defined as a relation without null values, the approaches for answering queries over databases do not always lead to semantically correct answer. In order to obtain all possible semantically correct answers, maybe answers have been considered along ...

متن کامل

Asking Queries about Frames

Frame-based knowledge representation and reasoning systems typically provide procedural interfaces for asking about properties of individuals and concepts. We propose an alternative declarative approach that extends standard interface functionality by supporting selective viewing of components of complex objects. Instead of just returning sets of individuals, our queries match concepts and lter...

متن کامل

A Framework for Efficient Query Answering on Semantically Heterogeneous Grids

With the rapid growth of grid computing, more and more data are generated and stored across the grid. To fully utilize the data, efficient data search and query answering mechanism is becoming a very important issue. However, the sheer amount of data and their heterogeneity nature pose challenges that current technology cannot cope with efficiently. In this paper, we propose an efficient query ...

متن کامل

On the Decidability of Consistent Query Answering

Consistent query answering (CQA) is about formally characterizing and computing semantically correct answers to queries posed to a database that may fail to satisfy certain integrity constraints. In this paper we revisit the decidability status of consistent query answering by considering different parameters of the problem as input to the decision problem. We obtain some new results about the ...

متن کامل

Theoretical/Technical Issues in Natural Language Access to Databases

In responding to the guidelines established by the session chairman of this panel, three of the five topics he set forth will be discussed. These include aggregate functions and quantity questions, querying semantically complex fields, and multi-file queries. As we will make clear in the sequel, the transformational apparatus utilized in the TQA Question Answering System provides a principled b...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2005